COSMIC掩星电子密度廓线的质量检核

利用COSMIC掩星任务自2010年至2014年的电离层电子密度廓线,使用只考虑廓线自身特性的4种参数进行质量检核,并对廓线质量的时空分布进行分析。发现在廓线质量的空间分布上,廓线不合格率在高纬地区最高,其次是低纬地区,在中纬地区最低,这可能与电子密度分布在磁赤道附近存在赤道异常、两极地区的磁场强度最大有关。廓线质量的季节变化较明显,在南、北半球,冬、春两季的廓线不合格率均显著高于夏、秋两季。另外,廓线质量具有一定昼夜分布特性,不合格率白天明显较夜晚低,且在晨昏分界线上变化较大。合格廓线的电子密度峰值和峰值高度分布在磁赤道附近明显高于其他区域,呈现"双驼峰"现象。     

基于灰色时序的完整性规范技术

计算机系统的完整性安全策略模型与规范问题，是计算机安全研究中最重要的课题之一。已有的研究结果离实际应用还相差太远，例如Ｃｌａｒｋ－Ｗｉｌｓｏｎ完整性模型只是提出了一个框架。本文呈现了我们构造的形式化灰色时序安全策略规范语言（ＧＴＳＬ）。ＧＴＳＬ的理论基础是灰色系统理论和时序规范语言ＬＯ－ＴＯＳ理论。由于它在完整性规范能力、完整性验证过程的构造与表示、责任分离合理性测试等一系列技术方面的完善与创新，使得ＧＴＳＬ成为真正能够实际使用的完整性安全策略规范语言。     

基于多分辨率的空军作战仿真建模研究

多分辨率建模技术是近年来建模与仿真领域研究的热点之一。首先分析了空军作战仿真面临的新挑战,指出多分辨率建模技术是解决现代作战仿真的有效方法;再在解析多分辨率建模相关概念的基础上,分析了空军作战仿真多分辨率建模的必要性;最后,采用面向实体的分析方法给出了空军作战仿真模型体系,并对模型聚合解聚问题进行了分析。     

E级超级计算机故障预测的数据采集方法

面向未来E级超级计算机,提出用于故障预测的数据采集框架,能够全面采集与计算结点故障相关的状态数据。采用自适应多层分组数据汇集方法,有效解决随着系统规模增长数据汇集过程开销过大的问题。在TH-1A超级计算机上的实现和测试表明,该数据采集框架具有开销小、扩展性好的优点,能够满足未来大规模系统故障预测数据采集的需求。     

模糊偏序关系的一种信息集成方法

以模糊超过关系、模糊不协调关系为例,就模糊偏序关系给出了一种基于分组加权极大(极小)算子的信息集成方法,讨论了该方法的一致性、非独裁性等性质.     

基于结构聚集度的海面目标特征描述及匹配方法

在对海面目标进行光电图像跟踪时,由于跟踪技术的局限性,跟瞄点往往会出现对目标的"失跟"现象,为了判断这一情况,通常需要对前后帧跟瞄区域的目标图像特征进行对比判别。但红外图像基本不存在颜色及纹理特征,而仅使用形状特征对于持续运动中的复杂目标图像又难以取得良好的效果。为解决这一问题,提出了一种基于目标结构聚集度的特征描述及匹配方法。首先对目标图像进行均匀矩形划分,在此基础上建立基于矩形块填充比的邻域矩阵作为图像特征,计算相邻帧图像该特征的欧氏距离差,并加入面积差参数进行特征匹配。对多种不同情况下的实测及模拟目标进行了计算机仿真实验,结果表明这种特征能够有效判断"失跟"情况,并且对于光学及红外目标旋转具有较好的不变性。     

动态灰色时序系统 DGTS 及其在安全策略规范中的应用

设计安全策略模型时应考虑安全策略的时序特性和灰色特性,还应综合考虑保密性、完整性和可用性三方面的需求。已有的安全模型没有描述时序性和灰色特性,而且一般只侧重描述保密性或完整性。为此,本文提出了动态灰色时序系统（简称ＤＧＴＳ）。本文详细描述了ＤＧＴＳ,以及基于ＤＧＴＳ的动态语义设计的灰色时序安全策略规范语言ＧＴＳＬ。     

Demand forecasting by temporal aggregation

Demand forecasting performance is subject to the uncertainty underlying the time series an organization is dealing with. There are many approaches that may be used to reduce uncertainty and thus to improve forecasting performance. One intuitively appealing such approach is to aggregate demand in lower‐frequency “time buckets.” The approach under concern is termed to as temporal aggregation, and in this article, we investigate its impact on forecasting performance. We assume that the nonaggregated demand follows either a moving average process of order one or a first‐order autoregressive process and a single exponential smoothing (SES) procedure is used to forecast demand. These demand processes are often encountered in practice and SES is one of the standard estimators used in industry. Theoretical mean‐squared error expressions are derived for the aggregated and nonaggregated demand to contrast the relevant forecasting performances. The theoretical analysis is supported by an extensive numerical investigation and experimentation with an empirical dataset. The results indicate that performance improvements achieved through the aggregation approach are a function of the aggregation level, the smoothing constant, and the process parameters. Valuable insights are offered to practitioners and the article closes with an agenda for further research in this area. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 479–498, 2013     

基于传递闭包的任务时序依赖关系建模方法

建立正确、有效的任务模型是正确引导出信息系统需求的关键步骤。文中针对任务间时序依赖关系,给出与任务建模相关的若干形式定义和命题,帮助分析人员判断任务间的并发和死锁。给出任务间时序依赖关系建模的详细步骤,并根据时序依赖关系的传递性质,给出一种任务关系图上的传递闭包方法,可以帮助分析人员直观地判断任务间时序依赖关系的问题和错误,科学、合理地标记各个任务的时序等级属性,帮助建模人员从全局上明确各个任务在执行时所处的相对位置,以及在每个阶段需要同时展开哪些任务。     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003